About the linear complexity of the almost perfect sequences

نویسنده

  • VLADIMIR EDEMSKIY
چکیده

We calculate the linear complexity of almost perfect binary sequences. Also we study the linear complexity of binary sequences obtained from series of almost perfect ternary sequences and the ternary sequences with two nonzero autocorrelation sidelobe levels. Key–Words: linear complexity, almost perfect sequences

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the use of expansion series for stream ciphers

From power series expansions of functions on curves over finite fields, one can obtain sequences with perfect or almost perfect linear complexity profile. It has been suggested by various authors to use such sequences as key streams for stream ciphers. In this work, we show how long parts of such sequences can be computed efficiently from short ones. Such sequences should therefore considered t...

متن کامل

On Sequences with a Perfect Linear Complexity Profile

We derive Bézout identities for the minimal polynomials of a finite sequence and use them to prove a theorem of Wang and Massey on binary sequences with a perfect linear complexity profile. We give a new proof of Rueppel’s conjecture and simplify Dai’s original proof. We obtain short proofs of results of Niederreiter relating the linear complexity of a sequence s and K(s), which was defined usi...

متن کامل

Multiplicities of Character Values of Binary Sidel'nikov-Lempel-Cohn-Eastman Sequences

Binary Sidel’nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we continue the study of [1]. We first express the multiple roots of character polynomials of SLCE sequences into certain kinds of Jacobi sums. Then by making use ...

متن کامل

On the Spaces of $lambda _{r}$-almost Convergent and $lambda _{r}$-almost Bounded Sequences

The aim of the present work is to introduce the concept of $lambda _{r}$-almost convergence of sequences. We define the spaces $fleft( lambda _{r}right) $ and $f_{0}left( lambda _{r}right) $ of $ lambda _{r}$-almost convergent and $lambda _{r}$-almost null sequences. We investigate some inclusion relations concerning those spaces with examples and we determine the $beta $- and $gamma $-duals of...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016